Tree transducers and tree languages

Well-Nested Tree Languages and Attributed Tree Transducers

Well-nested word languages have been advertised as adequate formalizations of the notion of mild context-sensitivity. The main result of this paper is a characterization of well-nested tree languages in terms of simple attributed tree transducers.

Random context tree grammars and tree transducers

Regular tree grammars and top-down tree transducers are extended by random context sensitivity as known from the areas of string and picture generation. First results regarding the generative power of the resulting devices are presented. In particular, we investigate the path languages of random context tree languages. Copyright c © 2005 UMINF 05.02 ISSN 0348-0542

A Pumping Lemma for Output Languages of Macro Tree Transducers

The concept of macro tree transducer is a formal model for studying properties of syntax{ directed translations and of functional languages which are based on primitive recursion. In this paper, for output languages of producing and nondeleting macro tree transducers, we introduce and prove a pumping lemma. We apply this pumping lemma to gain two results: (1) there is no producing and nondeleti...

Hierarchies of String Languages Generated by Deterministic Tree Transducers

String Languages Generated by Total Deterministic Macro Tree Transducers

The class of string languages obtained by taking the yields of output tree languages of total deterministic macro tree transducers (MTTs) is investigated. The rst main result is that MTTs which are linear and nondeleting in the parameters generate the same class of string languages as total deterministic top-down tree transducers. The second main result is a so called \bridge theorem"; it can b...